Decentralized estimation of Laplacian eigenvalues in multi-agent systems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decentralized Estimation of Laplacian Eigenvalues in Multi-Agent Systems

In this paper we present a decentralized algorithm to estimate the eigenvalues of the Laplacian matrix that encodes the network topology of a multi-agent system. We consider network topologies modeled by undirected graphs. The basic idea is to provide a local interaction rule among agents so that their state trajectory is a linear combination of sinusoids oscillating only at frequencies functio...

متن کامل

Decentralized Laplacian Eigenvalues Estimation of the Network Topology of a Multi-Agent System

In this paper we present the first known decentralized algorithm to estimate the eigenvalues of the Laplacian of the network topology of a multi-agent system. We provide formal proofs for the algorithm convergence properties and simulations to substantiate its effectiveness. The algorithm and the related theory are presented in continuous time. We finally show some numerical simulations and dis...

متن کامل

Decentralized Laplacian Eigenvalues Estimation and Collaborative Network Topology Identification

In this paper we first study observability conditions on networks. Based on spectral properties of graphs, we state new sufficient or necessary conditions for observability. These conditions are based on properties of the Khatri-Rao product of matrices. Then we consider the problem of estimating the eigenvalues of the Laplacian matrix associated with the graph modeling the interconnections betw...

متن کامل

Fault Detection and Isolation of Multi-Agent Systems via Complex Laplacian

This paper studies the problem of fault detection and isolation (FDI) for multi-agent systems (MAS) via complex Laplacian subject to actuator faults. A planar formation of point agents in the plane using simple and linear interaction rules related to complex Laplacian is achieved. The communication network is a directed, and yet connected graph with a fixed topology. The loss of symmetry in the...

متن کامل

Decentralized Coordination in Multi Agent Systems

Many computer systems are comprised of multiple entities (or agents) with common objectives. Though these systems can be made intelligent, using artificial intelligence techniques, individual agents are often restricted in their capabilities and have only limited knowledge of their environment. However, the group as a whole is capable of executing more complex tasks than a single agent can perf...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Automatica

سال: 2013

ISSN: 0005-1098

DOI: 10.1016/j.automatica.2013.01.029